Oo-line Reasoning for On-line Eeciency: Knowledge Bases
نویسندگان
چکیده
The complexity of reasoning is a fundamental issue in AI. In many cases, the fact that an intelligent system needs to perform reasoning on-line contributes to the diiculty of this reasoning. This paper considers the case in which an intelligent system computes whether a query is entailed by the system's knowledge base. It investigates how an initial phase of oo-line preprocessing and design can improve the on-line complexity considerably. The notion of an eecient basis for a query language is presented, and it is shown that oo-line prepro-cessing can be very eeective for query languages that have an eecient basis. The usefulness of this notion is illustrated by showing that a fairly expressive language has an eecient basis. A dual notion of an eecient disjunctive basis for a knowledge base is introduced, and it is shown that oo-line preprocessing is worthwhile for knowledge bases that have an eecient disjunctive basis.
منابع مشابه
Fair Oo-line E-cash Made Easy
The major considerations in designing a secure system are (1) simplicity of the algorithms involved, (2) eeciency of the implementation, and (3) provable security; these attributes contribute to the \elegance" of a system, easing its implementation (and limiting the possibility of errors) and the burden on system resources. Anonymous oo-line electronic cash (e-cash) systems provide transactions...
متن کاملPanel on \ Knowledge Compilation and Approximation " : Terminology , Questions
It is well known that problems in Logic, Automated Deduction and Artiicial Intelligence are very much demanding from the computational point of view. Two of the techniques that have been proposed for addressing such computational diiculties are Knowledge Compilation and Knowledge Approximation. The central idea of the former technique is to split the goal of answering to the question whether a ...
متن کاملOo-line Constraint Propagation for Eecient Hpsg Processing
We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a hpsg theory more speciic at those places where linguistically motivated underspeciication would lead to ineecient processing. We discuss two concrete hpsg examples showing how oo-line constraint propagation helps improve processing eeciency.
متن کاملOff-line Constraint Propagation for Efficient HPSG Processing
We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a hpsg theory more speciic at those places where linguistically motivated underspeciication would lead to ineecient processing. We discuss two concrete hpsg examples showing how oo-line constraint propagation helps improve processing eeciency.
متن کاملOo-line Electronic Cash Based on Secret-key Certiicates
An oo-line electronic coin system is presented that ooers multi-party security and unconditional privacy of payments. The system improves signiicantly on the eeciency of the previously most eecient such system known in the literature, due to application of a recently proposed technique called secret-key certiicates. By deenition of secret-key certiicates, pairs consisting of a public key and a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996